Generalized, efficient array decision procedures
نویسندگان
چکیده
The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allows to symbolically representing array updates. In this paper we present combinatory array logic, CAL, using a small, but powerful core of combinators, and reduce it to the theory of uninterpreted functions. CAL allows expressing properties that go well beyond the basic array theory. We provide a new efficient decision procedure for the base theory as well as CAL. The efficient procedure serves a critical role in the performance of the state-of-the-art SMT solver Z3 on array formulas from applications.
منابع مشابه
A generalized super-efficiency model for ranking extreme efficient DMUs in stochastic DEA
In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...
متن کاملOnline Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic?
Efficient decision procedures for arithmetic play a very important role in formal verification. In practical examples, however, arithmetic constraints are often mixed with constraints from other theories like the theory of arrays, Boolean satisfiability (SAT), bit-vectors, etc. Therefore, decision procedures for arithmetic are especially useful in combination with other decision procedures. The...
متن کاملMODULE GENERALIZED DERIVATIONS ON TRIANGULAUR BANACH ALGEBRAS
Let $A_1$, $A_2$ be unital Banach algebras and $X$ be an $A_1$-$A_2$- module. Applying the concept of module maps, (inner) modulegeneralized derivations and generalized first cohomology groups, wepresent several results concerning the relations between modulegeneralized derivations from $A_i$ into the dual space $A^*_i$ (for$i=1,2$) and such derivations from the triangular Banach algebraof t...
متن کاملDecision Procedures for Bit-vectors, Arrays and Integers a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
Decision procedures, also referred to as satisfiability procedures or constraint solvers, that can check satisfiability of formulas over mathematical theories such as Boolean logic, real and integer arithmetic are increasingly being used in varied areas of computer science like formal verification, program analysis, and artificial intelligence. There are two primary reasons for this trend. Firs...
متن کاملFuzzy multi-criteria selection procedures in choosing data source
Technology assessment and selection has a substantial impact on organizations procedures in regards to technology transfer. Technological decisions are usually made by a group of experts, and whereby integrity of these viewpoints to a single decision can be quite complex. Today, operational databases and data warehouses exist to manage and organize data with specific features and henceforth, th...
متن کامل